orthoDeprime: A Tool for Heuristic Cograph Editing on Estimated Orthology Graphs Bachelor’s Thesis
نویسندگان
چکیده
It is a common task in modern biology to analyze or reconstruct the relationship of different species. Since it is assumed that related species share a common ancestor species, many genes are shared between those. Two genes from different species are called orthologous, if they originate from the same gene in their common ancestor species. An orthology graph on a set of genes X is the graph with a set of nodes X where any two nodes are connected if and only if they represent orthologous genes. Recently, it has been discovered that a valid orthology graph is a cograph . However, the true orthology relation for X is unknown in practical applications, so it has to be estimated with an orthology detection tool. An example of such a program is POFF which uses sequence similarity and synteny information to determine orthologous genes in a given set of sequences. Unfortunately, errors are introduced by this estimation such that the orthology graph constructed from the output of POFF will in general not be a cograph. This work focuses on the task of modifying estimated orthology graphs by adding and removing edges in a way that it becomes a cograph. This problem is known as cograph editing and is in general NP -complete, which is why a heuristic approach is chosen. The motivation of the cograph editing process lies in the fact that it is possible to reconstruct the evolutionary history of the input genes when the cograph structure is restored. This information can then be used to reconstruct the phylogeny of a set of species. Another benefit is a more accurate orthology prediction resulting from the fact that the edited orthology graph will be more similar to the true one. Selbstständigkeitserklärung: „Ich versichere, dass ich die vorliegende Arbeit selbständig und nur unter Verwendung der angegebenen Quellen und Hilfsmittel angefertigt habe, insbesondere sind wörtliche oder sinngemäße Zitate als solche gekennzeichnet. Mir ist bekannt, dass Zuwiderhandlung auch nachträglich zur Aberkennung des Abschlusses führen kann.“ [Fak14] Leipzig, den Felix Kühnl
منابع مشابه
Exact and heuristic algorithms for Cograph Editing
We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an n-vertex graph that runs in O(3n) time and uses O(2) space. In this problem, we are given a graph G = (V,E) and the task is to find a smallest possible set F ⊆ V × V of vertex pairs such that (V,E4F ) is a cograph (or P4-free graph), where 4 represents the symmetric difference operator. We also de...
متن کاملMerging Modules is equivalent to Editing P4's
The modular decomposition of a graph G = (V,E) does not contain prime modules if and only if G is a cograph, that is, if no quadruple of vertices induces a simple connected path P4. The cograph editing problem consists in inserting into and deleting from G a set F of edges so that H = (V,E4F) is a cograph and |F | is minimum. This NP-hard combinatorial optimization 1 ar X iv :1 70 2. 07 49 9v 1...
متن کاملPhylogenomics with Paralogs
Phylogenomics heavily relies on well-curated sequence data sets that comprise, for each gene, exclusively 1:1 orthologos. Paralogs are treated as a dangerous nuisance that has to be detected and removed. We show here that this severe restriction of the data sets is not necessary. Building upon recent advances in mathematical phylogenetics, we demonstrate that gene duplications convey meaningful...
متن کاملOn Tree Representations of Relations and Graphs: Symbolic Ultrametrics and Cograph Edge Decompositions
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g. in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics define an edge-colored complete graph that allows to represent the topology of this graph as a vertex-colored tree. Here, we are interested in the structure a...
متن کاملRigidity Investigations in Virtual
Rigidity investigations in virtual Lego models In this thesis, we investigate the potential improvement of the algorithms detecting rigid structures in virtual Lego models in the computer application Lego Digital Designer. First, the previously achieved results are presented. This mainly involves a heuristic triangle rigidity detection algorithm described in a Bachelor’s thesis. Then, the two t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014